Graph congruences and wreath products

Graph-wreath products and finiteness conditionsI

A notion of graph-wreath product of groups is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type Fn. Under various additional assumptions we show that these conditions are necessary. Our results generalize results of Bartholdi, Cornulier and Kochloukova about wreath products. Graphwreath products of groups include class...

Coupled Cells: Wreath Products and Direct Products

In this note we discuss the structure of systems of coupled cells (which we view as systems of ordinary differential equations) where symmetries of the system are obtained through the group G of global permutations of the cells and the group L of local internal symmetries of the dynamics in each cell. We show that even when the cells are assumed to be identical with identical coupling, the way ...

The Wreath Products

Rooted Wreath Products

We introduce “rooted valuation products” and use them to construct universal Abelian lattice-ordered groups (with prescribed set of components) [CHH] from the more classical theory of [Ha]. The Wreath product construction of [H] and [HMc] generalised the Abelian (lattice-ordered) group ideas to a permutation group setting to respectively give universals for transitive (`-) permutation groups wi...

Eigenvalues of Random Wreath Products

Steven N. Evans Department of Statistics #3860, University of California at Berkeley 367 Evans Hall, Berkeley, CA 94720-3860, U.S.A [email protected] Abstract Consider a uniformly chosen element Xn of the n-fold wreath product Γn = G o G o · · · o G, where G is a finite permutation group acting transitively on some set of size s. The eigenvalues of Xn in the natural sn-dimensional permuta...